package 算法.leetcode.bytedance;

/**
 * @author lchenglong
 * @date 2022/5/12
 */
public class OfferArray_VII {
    public String getPermutation(int n, int k) {
        // A (n,k)
        // 求小于K的某个阶乘
        int i = 1,ans = 1;
        while (ans <k){
            ans *= ++i;
        }
        --i;
        // A (i,i)
        return null;
    }


}
